Kleene Theorems for Labelled Free Choice Nets
نویسندگان
چکیده
In earlier work [LMP11], we showed that a graph-theoretic condition called “structural cyclicity” enables us to extract syntax from a conflict-equivalent product system of automata. In this paper we have a “pairing” property in our syntax which allows us to connect to a broader class of product systems, where the conflict-equivalence is not statically fixed. These systems have been related to labelled free choice nets.
منابع مشابه
Kleene Theorems for Labelled Free Choice Nets without product acceptance condition
In an earlier work [18], we provided expressions for free choice nets having “distributed choice property” which makes the nets “direct product” representable. In a recent work [17], we gave equivalent syntax for a larger class of free choice nets obtained by dropping “distributed choice property”, thus syntactically characterizing nets which are not representable by direct products also. In bo...
متن کاملKleene Theorems for Product Systems
We prove Kleene theorems for two subclasses of labelled product systems which are inspired from well-studied subclasses of 1bounded Petri nets. For product T-systems we define a corresponding class of expressions. The algorithms from systems to expressions and in the reverse direction are both polynomial time. For product free choice systems with a restriction of structural cyclicity, that is, ...
متن کاملKleene Theorems for Synchronous Products with Matching
In earlier work [LMP11], we showed that a graph-theoretic condition called “structural cyclicity” enables us to extract syntax from a conflict-equivalent product system of automata. In this paper we have a “pairing” property in our syntax which allows us to connect to a broader class of synchronous product systems [Arn94] with a “matching” property, where the conflict-equivalence is not statica...
متن کاملKleene Theorem for Labelled Free Choice Nets without Distributed Choice
For 1-bounded nets, equivalent syntax have been given by Grabowski [8], Garg and Ragunath [7] and other authors Lodaya [14]. We work with 1-bounded, labelled free choice nets given with an S-cover, where the labels come from a distributed alphabet and S-components of the associated S-cover respect the alphabet distribution. In earlier work [21], we provided expressions for free choice nets havi...
متن کاملDirect Product Representation of Labelled Free Choice Nets
Hack's theorem [7] shows that every live and bounded free choice net is covered by S-components [5, 2]. If the net is labelled, with a distribution of the alphabet into possibly overlapping subalphabets for components, the question arose whether the net can be decomposed into a product of automata, with several possible definitions of product and of equivalence [1, 13, 11, 4]. Zielonka sho...
متن کامل